Pomsets for Message Sequence Charts

نویسندگان

  • Joost-Pieter Katoen
  • Lennard Lamberty
چکیده

Message sequence charts (MSCs) are a standardised formalism for the specification of the system’s communication behaviour that is widely used by industry. Various extensions to MSCs have recently been standardised by the ITU. This paper treats the extension of MSCs with structural operators that allow the hierarchical composition of MSCs. In particular, we propose a linear-time partial-order semantics for this extension that is based on the notion of partial-order multi-sets (pomsets, for short). We provide a compositional denotational semantics for hierarchical MSCs and show that well-known operations on pomsets correspond to the new composition operators in MSCs. The main benefit of our approach is that the semantics is conceptually rather straightforward, as opposed to the operational semantics for MSCs that is currently in the process of standardisation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Sets of Pomsets with Autoconcurrency

Partially ordered multisets (or pomsets) constitute one of the most basic models of concurrency. We introduce and compare several notions of regularity for pomset languages by means of contexts and residues of different kinds. We establish some interesting closure properties that allow us to relate this approach to SP-recognizability in the particular case of series-parallel pomsets. Finally we...

متن کامل

Distributed Pomset Languages: regularity, recognisability, rationality

The study of regularity notions for languages of labelled partial orders (pomsets) is of growing interest in particular for the model checking of distributed systems. We consider nite pomsets without autoconcurrency, distributed over a nite set of processes. They are structured as a monoid by means of a located concatenation operation and we also consider the submonoid generated by a set of pri...

متن کامل

Dagstuhl Seminar on Logic, Algebra, and Formal Verification of Concurrent Systems

s of the Talks 6 Pascal Weil Recognizability and regularity for languages of series-parallel pomsets . . . . . . . . . . . . . 6 Lenore Zuck Automatic Deductive Verification with Invisible Invariants . . 7 Manfred Droste Process Cost Functions for Concurrent Systems . . . . . . . . 7 Doron Peled Black Box Checking . . . . . . . . . . . . . . . . . . . . . . . . 8 Rémi Morin On Rational Message ...

متن کامل

Event Correlation with Boxed Pomsets

This paper proposes a diagnosis framework for distributed systems based on pomset languages. Diagnosis is performed by projecting these models on a collection of observable labels and then synchronization with an observation. This paper first proposes a new model called boxed pomset languages, which extends classical pomset-based languages as so called High-level Message Sequence Charts. It can...

متن کامل

An algebraic semantics of Message Sequence Charts

Message Sequence Charts is a graphical and textual language for the description and speciication of the interactions between system components and their environment. The language is standardized by the ITU-TS (the Telecommunication Standardization section of the International Telecommunication Union, the former CCITT). The main area of application for Message Sequence Charts is as an overview s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998